Lucid[2]

Ashcroft & William Wadge, 1981

A dataflow language descended from ISWIM, lazy but first-order. Statements are regarded as equations defining a network of processors and communication lines, through which the data flows. Every data object is thought of as an infinite stream of simple values, every function as a filter. Lucid has no data constructors such as arrays or records. Iteration is simulated with 'is current' and 'fby' (concatenation of sequences).

Lucid, the Dataflow Programming Language, William Wadge, Academic Press, 1985.